Review Minimal Semantics

نویسندگان

  • Emma Borg
  • ROBYN CARSTON
چکیده

As the title of her book indicates, Emma Borg is a minimalist with regard to semantics and, like many minimalists, sees herself as defending her patch from the encroachments of the ‘contextualist hoards’. She is, therefore, taking up a particular position within what is seen by many philosophers of language as a foundational debate concerning the true bearers of semantic (truth-conditional) content. According to the minimalist (or ‘literalist’), natural language sentences represent the world as being a certain way and are true or false depending on how the world is. The contextualist maintains that this is a category mistake, that it is utterances or speech acts that have such content and, whatever semantic properties sentences have, it is only in conjunction with the non-linguistic information in contexts of utterance that they eventuate in truth-conditional content. In other words, minimalists believe that there is a formally-driven, pragmatics-free level of semantic content, while contextualists believe that there is no level of semantic content without quite extensive pragmatic input. Viewed this way it certainly sounds like a substantive debate. However, there is another way of looking at the territory which makes the difference in the positions seem rather less momentous. Most of the current players in the debate, whether minimalist or contextualist, agree that there are three kinds or levels of meaning involved in verbal communication: linguistic expression-type meaning, what the speaker said, and what the speaker implicated. The latter two are pragmatic kinds of meaning, though ‘what is said’ is significantly shaped by linguistic meaning, and both are, of course, fully truthconditional. Given a clear distinction between sentence-type meaning and what is said, which

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing the p-stable semantics

In this paper we review some theoretical results about the p-stable semantics, and based on that, we design some algorithms that search for the p-stable models of a normal program. An important point is that some of these algorithms can also be used to compute the stratified minimal models of a normal program.

متن کامل

Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints

Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist.

متن کامل

Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints

Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist.

متن کامل

Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints

Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures, by translation into normal dominance constraints.

متن کامل

Semantics Of Non-Terminating Systems Through Term Rewriting

This thesis is primarily concerned with the algebraic semantics of non-terminating term rewriting systems. The usual semantics for rewrite system is based in interpreting rewrite rules as equations and rewriting as a particular case of equational reasoning. The termination of a rewrite system ensures that every term has a value (normal form). But, in general we cannot guarantee this. The resear...

متن کامل

Minimal founded semantics for disjunctive logic programs and deductive databases

In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009